/**
 * 0242
 *
 * @Author : Ruoyu Wang
 * @DateTime : 2024/8/12 22:03
 */

#include <iostream>
#include <vector>
#include "unordered_map"

using namespace std;

class Solution {
public:
    bool isAnagram(string s, string t) {
        if (s.size() != t.size())return false;
        unordered_map<int, int> maps;
        unordered_map<int, int> mapt;
        for (int i = 0; i < s.size(); ++i) {
            maps[s[i]]++;
            mapt[t[i]]++;
        }
        for (auto e: maps) {
            if (mapt[e.first] != e.second)return false;
        }
        return true;
    }
};

int main() {

    return 0;
}